package P3排序算法;

import java.util.Random;

public class DataUtil {
    private static int N = 50000;
    private static Random random = new Random();
    //完全随机
    public static int[] getData01() {
        int[] arr = new int[N];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = random.nextInt(100000);
        }
        return arr;
    }
    //大致升序
    public static int[] getData02() {
        int[] arr = new int[N];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = i;
        }
        return arr;
    }
    //大致降序
    public static int[] getData03() {
        int[] arr = new int[N];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = 10000 - i;
        }
        return arr;
    }
    //大致相等
    public static int[] getData04() {
        int[] arr = new int[N];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = 6;
        }
        return arr;
    }
    public static int[] copy(int[] arr) {
        int[] carr = new int[arr.length];
        for (int i = 0; i < carr.length; i++) {
            carr[i] = arr[i];
        }
        return carr;
    }
}
